#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1e5 + 10;

int n, m;
int num[N];
int sum[N];
int tot = 0;

inline void solution() {
    cin >> n;
    for (int i = 1; i <= n; i ++ ) {
        cin >> num[i - 1];
        tot += num[i - 1];
        sum[i] = sum[i - 1] + num[i - 1];
    }

    cin >> m;
    for (int i = 0; i < m; i ++ ) {
        int l, r;
        cin >> l >> r;
        if (l > r) {
            int t = r; r = l; l = t;
        }
        cout << min(sum[r - 1] - sum[l - 1], tot - (sum[r - 1] - sum[l - 1])) << endl;
    }
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}